Termination w.r.t. Q proof of TRS/TRCSREx9_BLR02

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, n__filter₃(activate₁(Y), M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, n__filter₃(activate₁(Y), N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, n__sieve₁(activate₁(Y)))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), n__sieve₁(n__filter₃(activate₁(Y), N, N)))
nats₁(N) -> cons₂(N, n__nats₁(n__s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))
filter₃(X1, X2, X3) -> n__filter₃(X1, X2, X3)
sieve₁(X) -> n__sieve₁(X)
nats₁(X) -> n__nats₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__filter₃(X1, X2, X3)) -> filter₃(activate₁(X1), activate₁(X2), activate₁(X3))
activate₁(n__sieve₁(X)) -> sieve₁(activate₁(X))
activate₁(n__nats₁(X)) -> nats₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, n__filter₃(activate₁(Y), M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, n__filter₃(activate₁(Y), N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, n__sieve₁(activate₁(Y)))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), n__sieve₁(n__filter₃(activate₁(Y), N, N)))
nats₁(N) -> cons₂(N, n__nats₁(n__s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))
filter₃(X1, X2, X3) -> n__filter₃(X1, X2, X3)
sieve₁(X) -> n__sieve₁(X)
nats₁(X) -> n__nats₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__filter₃(X1, X2, X3)) -> filter₃(activate₁(X1), activate₁(X2), activate₁(X3))
activate₁(n__sieve₁(X)) -> sieve₁(activate₁(X))
activate₁(n__nats₁(X)) -> nats₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X3)
SIEVE₁(cons₂(s₁(N), Y)) -> ACTIVATE₁(Y)
FILTER₃(cons₂(X, Y), s₁(N), M) -> ACTIVATE₁(Y)
ZPRIMES -> SIEVE₁(nats₁(s₁(s₁(0))))
ACTIVATE₁(n__nats₁(X)) -> ACTIVATE₁(X)
ACTIVATE₁(n__nats₁(X)) -> NATS₁(activate₁(X))
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X1)
FILTER₃(cons₂(X, Y), 0, M) -> ACTIVATE₁(Y)
ZPRIMES -> S₁(0)
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X2)
ZPRIMES -> S₁(s₁(0))
ACTIVATE₁(n__s₁(X)) -> S₁(activate₁(X))
SIEVE₁(cons₂(0, Y)) -> ACTIVATE₁(Y)
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> FILTER₃(activate₁(X1), activate₁(X2), activate₁(X3))
ACTIVATE₁(n__sieve₁(X)) -> ACTIVATE₁(X)
ZPRIMES -> NATS₁(s₁(s₁(0)))
ACTIVATE₁(n__sieve₁(X)) -> SIEVE₁(activate₁(X))
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, n__filter₃(activate₁(Y), M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, n__filter₃(activate₁(Y), N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, n__sieve₁(activate₁(Y)))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), n__sieve₁(n__filter₃(activate₁(Y), N, N)))
nats₁(N) -> cons₂(N, n__nats₁(n__s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))
filter₃(X1, X2, X3) -> n__filter₃(X1, X2, X3)
sieve₁(X) -> n__sieve₁(X)
nats₁(X) -> n__nats₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__filter₃(X1, X2, X3)) -> filter₃(activate₁(X1), activate₁(X2), activate₁(X3))
activate₁(n__sieve₁(X)) -> sieve₁(activate₁(X))
activate₁(n__nats₁(X)) -> nats₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X3)
SIEVE₁(cons₂(s₁(N), Y)) -> ACTIVATE₁(Y)
FILTER₃(cons₂(X, Y), s₁(N), M) -> ACTIVATE₁(Y)
ZPRIMES -> SIEVE₁(nats₁(s₁(s₁(0))))
ACTIVATE₁(n__nats₁(X)) -> ACTIVATE₁(X)
ACTIVATE₁(n__nats₁(X)) -> NATS₁(activate₁(X))
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X1)
FILTER₃(cons₂(X, Y), 0, M) -> ACTIVATE₁(Y)
ZPRIMES -> S₁(0)
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X2)
ZPRIMES -> S₁(s₁(0))
ACTIVATE₁(n__s₁(X)) -> S₁(activate₁(X))
SIEVE₁(cons₂(0, Y)) -> ACTIVATE₁(Y)
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> FILTER₃(activate₁(X1), activate₁(X2), activate₁(X3))
ACTIVATE₁(n__sieve₁(X)) -> ACTIVATE₁(X)
ZPRIMES -> NATS₁(s₁(s₁(0)))
ACTIVATE₁(n__sieve₁(X)) -> SIEVE₁(activate₁(X))
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, n__filter₃(activate₁(Y), M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, n__filter₃(activate₁(Y), N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, n__sieve₁(activate₁(Y)))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), n__sieve₁(n__filter₃(activate₁(Y), N, N)))
nats₁(N) -> cons₂(N, n__nats₁(n__s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))
filter₃(X1, X2, X3) -> n__filter₃(X1, X2, X3)
sieve₁(X) -> n__sieve₁(X)
nats₁(X) -> n__nats₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__filter₃(X1, X2, X3)) -> filter₃(activate₁(X1), activate₁(X2), activate₁(X3))
activate₁(n__sieve₁(X)) -> sieve₁(activate₁(X))
activate₁(n__nats₁(X)) -> nats₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 6 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X3)
SIEVE₁(cons₂(s₁(N), Y)) -> ACTIVATE₁(Y)
FILTER₃(cons₂(X, Y), s₁(N), M) -> ACTIVATE₁(Y)
SIEVE₁(cons₂(0, Y)) -> ACTIVATE₁(Y)
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> FILTER₃(activate₁(X1), activate₁(X2), activate₁(X3))
ACTIVATE₁(n__nats₁(X)) -> ACTIVATE₁(X)
ACTIVATE₁(n__sieve₁(X)) -> ACTIVATE₁(X)
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X1)
FILTER₃(cons₂(X, Y), 0, M) -> ACTIVATE₁(Y)
ACTIVATE₁(n__filter₃(X1, X2, X3)) -> ACTIVATE₁(X2)
ACTIVATE₁(n__sieve₁(X)) -> SIEVE₁(activate₁(X))
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, n__filter₃(activate₁(Y), M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, n__filter₃(activate₁(Y), N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, n__sieve₁(activate₁(Y)))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), n__sieve₁(n__filter₃(activate₁(Y), N, N)))
nats₁(N) -> cons₂(N, n__nats₁(n__s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))
filter₃(X1, X2, X3) -> n__filter₃(X1, X2, X3)
sieve₁(X) -> n__sieve₁(X)
nats₁(X) -> n__nats₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__filter₃(X1, X2, X3)) -> filter₃(activate₁(X1), activate₁(X2), activate₁(X3))
activate₁(n__sieve₁(X)) -> sieve₁(activate₁(X))
activate₁(n__nats₁(X)) -> nats₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.